The Global Weak Sharp Minima with Explicit Exponents in Polynomial Vector Optimization Problems
نویسنده
چکیده
In this paper we discuss the global weak sharp minima property for vector optimization problems with polynomial data. Exploiting the imposed polynomial structure together with tools of variational analysis and a quantitative version of Lojasiewicz’s gradient inequality due to D’Acunto and Kurdyka, we establish the Hölder type global weak sharp minima with explicitly calculated exponents.
منابع مشابه
Weak Sharp Minima with Explicit Exponents in Vector Optimization Problems with Polynomial Data
In this paper we discuss weak sharp minima for vector optimization problems with polynomial data. Exploiting the imposed polynomial structure together with powerful tools of variational analysis and semialgebraic geometry and under some slight assumptions, we establish (Hölder type) bounded and global weak sharp minima with explicitly calculated exponents.
متن کاملOn weak sharp minima in vector optimization with applications to parametric problems
In the paper we discuss the concepts of weak sharp solutions to vector optimization problems. As an application we provide sufficient conditions for stability of solutions in perturbed vector optimization problems.
متن کاملWeak Sharp Minima on Riemannian Manifolds
This is the first paper dealing with the study of weak sharp minima for constrained optimization problems on Riemannian manifolds, which are important in many applications. We consider the notions of local weak sharp minima, boundedly weak sharp minima, and global weak sharp minima for such problems and establish their complete characterizations in the case of convex problems on finite-dimensio...
متن کاملEquivalent properties of global weak sharp minima with applications
* Correspondence: [email protected] Department of Mathematics, School of Science, Shandong University of Technology, Zibo, 255049, China Full list of author information is available at the end of the article Abstract In this paper, we study the concept of weak sharp minima using two different approaches. One is transforming weak sharp minima to an optimization problem; another is using conju...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کامل